On the Use of the Klein Quadric for Geometric Incidence Problems in Two Dimensions

We discuss a unified approach to a class of geometric combinatorics incidence problems in two dimensions, of the Erdős distance type. The goal is obtaining the second moment estimate. That is, given a finite point set S in 2D, and a function f on S × S, find the upper bound for the number of solutions of the equation (1) f(p, p′) = f(q, q′) 6= 0, (p, p′, q, q′) ∈ S × S × S × S. E.g., f is the Euclidean distance in the plane, sphere, or a sheet of the two-sheeted hyperboloid. Our ultimate tool is the Guth-Katz incidence theorem for lines in RP, but we focus on how the original problem in 2D gets reduced to its application. The corresponding procedure was initiated by Elekes and Sharir, based on symmetry considerations. The point we make here is that symmetry considerations, not be necessarily straightforward and potentially requiring group representation machinery can be bypassed or made implicit. The classical Plücker-Klein formalism for line geometry enables one to directly interpret a solution of (1) as intersection of two lines in RP. This, e.g., allows for a very brief argument as to how the Euclidean plane distance argument extends to the spherical and hyperbolic distances. The space of lines in the projective three-space, the Klein quadric K, is four-dimensional. Thus, we start out with an injective map F : S × S → K, that is from a pair of points (p, q) to a line lpq and seek a corresponding combinatorial problem in the form (1) in two dimensions, which can be solved by applying the Guth-Katz theorem to the set of lines {lpq} in RP. We identify a few arguably new such problems, and hence applications of the Guth-Katz theorem and make generalisations of the existing ones. It is the direct approach in question that is the main purpose of this paper.